Pseudo-median graphs: decomposition via amalgamation and Cartesian multiplication
نویسندگان
چکیده
منابع مشابه
Pseudo-median graphs are join spaces
Bandelt, H.-J. and H.M. Mulder, Pseudo-median graphs are join spaces, Discrete Mathematics 109 (1992) 13-26. Median graphs are known to share a number of geometrica! properties with Euclidean space, as is testified by the fact that median graphs ale (c!osed) join spaces-the segments of the associated join space being the geodesic intervals of the graph. As is shown in this paper the median join...
متن کاملDecomposition andl1-Embedding of Weakly Median Graphs
Weakly median graphs, being defined by interval conditions and forbidden induced subgraphs, generalize quasi-median graphs as well as pseudo-median graphs. It is shown that finite weakly median graphs can be decomposed with respect to gated amalgamation and Cartesian multiplication into 5-wheels, induced subgraphs of hyperoctahedra (alias cocktail party graphs), and 2-connected bridged graphs n...
متن کاملCrossing Graphs as Joins of Graphs and Cartesian Products of Median Graphs
For a partial cube G its crossing graph G is the graph with vertices representing Θ-classes of G, two classes being adjacent if they cross on some cycle in G. The following problem posed in [11, Problem 7.1] is considered: what can be said about the partial cube G if G is the join A⊕B of not edge-less graphs A and B? It is proved that for arbitrary graphs A and B, where at least one of them con...
متن کاملOPTIMAL DECOMPOSITION OF FINITE ELEMENT MESHES VIA K-MEDIAN METHODOLOGY AND DIFFERENT METAHEURISTICS
In this paper the performance of four well-known metaheuristics consisting of Artificial Bee Colony (ABC), Biogeographic Based Optimization (BBO), Harmony Search (HS) and Teaching Learning Based Optimization (TLBO) are investigated on optimal domain decomposition for parallel computing. A clique graph is used for transforming the connectivity of a finite element model (FEM) into that of the cor...
متن کاملOn Median Graphs and Median Grid Graphs on Median Graphs and Median Grid Graphs
Let e be an edge of a median graph G which is contained in exactly one 4-cycle. Then it is proved that G n e is a median graph. The converse holds as well provided that e is not contained is a subgraph isomorphic to the 3-cube minus a vertex. These results are used to give several characterizations of median grid graphs. (Grid graphs are subgraphs of complete grids, i.e. of the Cartesian produc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1991
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90022-t